Proving Computational Ability
نویسندگان
چکیده
We investigate extending the notion of a proof of knowledge to a proof of the ability to perform some computational task. We provide some definitions and protocols for this purpose.
منابع مشابه
Extension Ability of Reduced Order Model of Unsteady Incompressible Flows Using a Combination of POD and Fourier Modes
In this article, an improved reduced order modelling approach, based on the proper orthogonal decomposition (POD) method, is presented. After projecting the governing equations of flow dynamics along the POD modes, a dynamical system was obtained. Normally, the classical reduced order models do not predict accurate time variations of flow variables due to some reasons. The response of the dynam...
متن کاملتوسعه روش SL با ترتیب KBO برای اثبات خودکار پایان‌پذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران
The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...
متن کاملCOMPUTATIONAL RESULTS ON FINITE P-GROUPS OF EXPONENT P2
The Fibonacci lengths of the finite p-groups have been studied by R. Dikici and co-authors since 1992. All of the considered groups are of exponent p, and the lengths depend on the celebrated Wall number k(p). The study of p-groups of nilpotency class 3 and exponent p has been done in 2004 by R. Dikici as well. In this paper we study all of the p-groups of nilpotency class 3 and exponent p2. Th...
متن کاملTwo Interpretative Analyses of the Verses on Reasoning and Thinking in Proving Thinking-Orientedness of the Educational Model of the Holy Qur'an
In the scientific and cultural literature, the term "education" includes all the aspects and components of a process that provides the ground for the conscious and voluntary transformation of mankind. Based on the Islamic viewpoint, this concept includes all actions and measures, including correction, purification, teaching and admonition, which must be carefully and coherently organized in a s...
متن کاملProvability in Intuitionistic Linear Logic from a New Interpretation on Petri nets
Linear logic is a logic of actions which seems well suited to various computer science applications. From its intrinsic ability to reeect computational resources, it is possible to reene diierent programming paradigms like formulae-as-types (proofs-as-programs) or formulae-as-states (proofs-as-computations) with a ner control on resource management. In the latter case, the correspondence betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011